An Accelerated Dual Fast Marching Tree Applied to Emergency Geometric Trajectory Generation

نویسندگان

چکیده

This paper addresses the generation of aircraft emergency trajectories with obstacle avoidance. After presenting in detail fast marching tree algorithm, this we propose an improvement its performance. First, free space checking function is sped up. Then, algorithm used twice, firstly sampling a few points to generate approximate trajectory, and secondly close first computed trajectory refine it. The proposed method significantly reduces computing time geometric generation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions

In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...

متن کامل

Fast Marching Method Applied For Emergency Evacuation in High-rise Building Fire

In this paper, we use the fast marching method to solve the emergency evacuation in high-rise building fire. This method is a numerical method which is used to solve the Eikonal equation in rectangular grids. As we know, building fires are very common in the world. They have caused a great deal of personnel casualty and property losses. How to reduce the casualty and ensure the life safety of t...

متن کامل

Dual-Tree Fast Gauss Transforms

Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the ...

متن کامل

How to Deal with Difficulty and Uncertainty in the Outdoor Trajectory Planning with Fast Marching

This paper presents an interesting technique for finding the trajectory of an outdoor robot. This technique applies Fast Marching to a 3D surface terrain represented by a triangular mesh in order to calculate a smooth trajectory between two points. The method uses a triangular mesh instead of a square one because this kind of grid adapts better to 3D surfaces. The novelty of this approach is th...

متن کامل

Fast Marching to Moving Object Location

In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statistical and level set approaches are adopted in order to formulate these problems. For the change detection problem, the inter-frame di erence is modeled by a mixture of two zero-mean Laplacian distributions. At rst, statistical tests using criteria with negligible err...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Aerospace

سال: 2022

ISSN: ['2226-4310']

DOI: https://doi.org/10.3390/aerospace9040180